Water Wave Optimization Algorithm for Solving Multi-Area Economic Dispatch Problem
نویسندگان
چکیده
منابع مشابه
Water Wave Optimization Algorithm for Solving Multi-Area Economic Dispatch Problem
This paper presents the Water Wave Optimization Algorithm (WWOA) for solving multi-area economic dispatch (MAED) problem with tie line constraints considering transmission losses, area demand constraints, multiple fuels options, valve-point loading effects and prohibited operating zones. Here, the amount of power that can be economically generated in one or more areas are exchanged with other a...
متن کاملWater Evaporation Optimization Algorithm for Solving Dynamic Economic Dispatch
This paper presents an efficient Water Evaporation Optimization algorithm (WEO) is proposed to solve a Dynamic Economic Dispatch problem (DED). The dynamic dispatch problem differs from the static economic dispatch problem by incorporating generator spinning reserve, ramp rate limits, and valve point loading and transmission losses. The proposed water evaporation optimization algorithm is based...
متن کاملWater Wave Optimization Algorithm for Solving Economic Dispatch Problems with Generator Constraints
This paper presents the application of Water Wave Optimization Algorithm (WWOA) for solving economic dispatch problems including practical generator constraints. WWOA is inspired by the shallow water wave theory. The efficiency of the WWO Algorithm for solving economic dispatch problems is demonstrated by implementing it on three test systems having three, six and fifteen generating units with ...
متن کاملHybrid Particle Swarm Optimization for Solving Multi-area Economic Dispatch Problem
We consider the Multi-Area Economic Dispatch problem (MAEDP) in deregulated power system environment for practical multi-area cases with tie line constraints. Our objective is to generate allocation to the power generators in such a manner that the total fuel cost is minimized while all operating constraints are satisfied. This problem is NP-hard. In this paper, we propose Hybrid Particle Swarm...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2017
ISSN: 0975-8887
DOI: 10.5120/ijca2017914247